Forbidden subgraphs generating a finite set
نویسندگان
چکیده
منابع مشابه
Forbidden subgraphs generating a finite set
For a set F of connected graphs, a graph G is said to be F-free if G does not contain any member of F as an induced subgraph. The members of F are referred to as forbidden subgraphs. When we study the relationship between forbidden subgraphs and a certain graph property, we often allow the existence of exceptional graphs as long as their number is finite. However, in this type of research, if t...
متن کاملForbidden Triples Generating a Finite set of 3-Connected Graphs
For a graph G and a set F of connected graphs, G is said be F-free if G does not contain any member of F as an induced subgraph. We let G3(F) denote the set of all 3-connected F-free graphs. This paper is concerned with sets F of connected graphs such that |F| = 3 and G3(F) is finite. Among other results, we show that for an integer m > 3 and a connected graph T of order greater than or equal t...
متن کاملForbidden Subgraphs Generating Almost the Same Sets
Let H be a set of connected graphs. A graph G is said to be H-free if G does not contain any element of H as an induced subgraph. Let Fk(H) be the set of k-connected H-free graphs. When we study the relationship between forbidden subgraphs and a certain graph property, we often allow a finite exceptional set of graphs. But if the symmetric difference of Fk(H1) and Fk(H2) is finite and we allow ...
متن کاملFinite families of forbidden subgraphs for rainbow connection in graphs
A connected edge-colored graph G is rainbow-connected if any two distinct vertices of G are connected by a path whose edges have pairwise distinct colors; the rainbow connection number rc(G) of G is the minimum number of colors such that G is rainbow-connected. We consider families F of connected graphs for which there is a constant kF such that, for every connected F-free graph G, rc(G) ≤ diam...
متن کاملGraphs with Forbidden Subgraphs
Many graphs which are encountered in the study of graph theory are characterized by a type of configuration or subgraph they possess. However, there are occasions when such graphs are more easily defined or described by the kind of subgraphs they are not permitted to contain. For example, a tree can be defined as a connected graph which contains no cycles, and Kuratowski [22] characterized plan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2013
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.05.015